Shortest path tree

Results: 178



#Item
1Graph theory / Mathematics / Computational complexity theory / Edsger W. Dijkstra / Network theory / Shortest path problem / Minimum spanning tree / Network flow / Dynamic programming

LNCSEfficient Dynamic Aggregation

Add to Reading List

Source URL: webee.technion.ac.il

Language: English - Date: 2007-05-14 09:17:03
2Graph theory / Mathematics / Network theory / Routing algorithms / Edsger W. Dijkstra / Spanning tree / Bipartite graphs / Shortest path problem / Tree / Graph / Geographic routing / Routing

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

Add to Reading List

Source URL: www.dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:56
3Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Vertex cover / Steiner tree problem / Shortest path problem / Linear programming / Edge disjoint shortest pair algorithm / Minimum bottleneck spanning tree

A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2009-03-26 07:24:20
4Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance

Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2012-04-20 08:45:09
5Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / Edsger W. Dijkstra / Spanning tree / Operations research / Shortest path problem / Graph / Linear programming / Steiner tree problem

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:36
6Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Steiner tree problem / XTR / Shortest path problem / Flow network / Maximum flow problem / Graph coloring

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:39
7Graph theory / Mathematics / Spanning tree / Steiner tree problem / Minimum spanning tree / Shortest path problem / Eulerian path / Line graph / Expected linear time MST algorithm / Minimum bottleneck spanning tree

CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-10 00:55:12
8Graph theory / Mathematics / Routing algorithms / Edsger W. Dijkstra / Combinatorial optimization / Search algorithms / Game artificial intelligence / A* search algorithm / Shortest path problem / Flow network / Tree / Graph

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
9Spanning tree / NP-complete problems / Routing algorithms / Edsger W. Dijkstra / Combinatorial optimization / Steiner tree problem / Minimum spanning tree / Shortest path problem / Eulerian path / Algorithm / Randomized algorithm / Matching

Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-11-30 21:17:11
10Network theory / NP-complete problems / Edsger W. Dijkstra / Graph coloring / Spanning tree / Matching / Shortest path problem / Logical matrix / Treewidth / Matrix / Minimum spanning tree / Clique

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11
UPDATE